Dynamic probabilistic constraints under continuous random distributions
نویسندگان
چکیده
منابع مشابه
Support vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملOptimal Control of a Continuous Distillation Process under Probabilistic Constraints
A continuous distillation process with random inflow rate is considered. The aim is to find a control (feed rate, heat supply, reflux rate) which is optimal with respect to energy consumption and which is robust at the same time with respect to the stochastic level constraints in the feed tank. The solution approach is based on the formulation of probabilistic constraints. An overall model incl...
متن کاملProgramming under Probabilistic Constraints with a Random Technology Matrix
Probabilistic constraint of the type P (Ax ≤ β) ≥ p is considered and it is proved that under some conditions the constraining function is quasi-concave. The probabilistic constraint is embedded into a mathematical programming problem of which the algorithmic solution is also discussed.
متن کاملsupport vector regression with random output variable and probabilistic constraints
support vector regression (svr) solves regression problems based on the concept of support vector machine (svm). in this paper, a new model of svr with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملProbabilistic Reasoning with Continuous Constraints
Continuous constraint reasoning assumes the uncertainty of numerical variables within given bounds and propagates such knowledge through a network of constraints, reducing the uncertainty. In some problems there is also information about the plausibility distribution of values within such bounds. However, the classical constraint framework cannot accommodate that information. This paper describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01593-z